Conservation methods in queuing theory

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Queuing Theory

This paper defines the building blocks of and derives basic queuing systems. It begins with a review of some probability theory and then defines processes used to analyze queuing systems, in particular the birth-death process. A few simple queues are analyzed in terms of steady-state derivation before the paper discusses some attempted field research on the topic.

متن کامل

Application of queuing theory in production-inventory optimization

This paper presents a mathematical model for an inventory control system in which customers’ demands and suppliers’ service time are considered as stochastic parameters. The proposed problem is solved through queuing theory for a single item. In this case, transitional probabilities are calculated in steady state. Afterward, the model is extended to the case of multi-item inventory systems. The...

متن کامل

Queuing Theory 2014 - Exercises

The importance for this tutorial is to introduce the students into the loss systems, and, to underline the difference between the concepts of call-blocking and time-blocking probabilities, and to understand under which conditions these probabilities are identical. The selected exercises introduce, also, the Erlang tables, which is an important tool for easy calculations for the blocking probabi...

متن کامل

Application of queuing theory in inventory systems with substitution flexibility

Considering the competition in today’s business environment, tactical planning of a supply chain becomes more complex than before. In many multi-product inventory systems, substitution flexibility can improve profits. This paper aims to prepare a comprehensive substitution inventory model, where an inventory system with two substitute products with ignorable lead time has been considered, and e...

متن کامل

Adversarial queuing theory with setups

We look at routing and scheduling problems on Kelly type networks where the injection process is under the control of an adversary. The novelty of the model we consider is that the adversary injects requests of distinct types. Resources are subject to switch-over delays or setups when they begin servicing a new request class. In this new setting, we study the behavior of sensible policies as in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle

سال: 1973

ISSN: 0397-9350

DOI: 10.1051/ro/197307v100631